Wiener indices of balanced binary trees
نویسندگان
چکیده
منابع مشابه
Wiener Indices of Balanced Binary Trees
Molecules and molecular compounds are often modeled by molecular graphs. One of the most widely known topological descriptor [6, 9] is the Wiener index named after chemist Harold Wiener [13]. The Wiener index of a graph G(V, E) is defined as W (G) = ∑ u,v∈V d(u, v), where d(u, v) is the distance between vertices u and v (minimum number of edges between u and v). A majority of the chemical appli...
متن کاملWiener Indices of Binary Trees
One of the most widely known topological index is the Wiener index. The Wiener Index Conjecture states that all positive integer numbers except a finite set are the Wiener indices of some trees. We explore the Wiener indices of the binary trees. We present efficient algorithms for generating the Wiener indices of the binary trees. Based on experiments we strengthen the conjecture for the class ...
متن کاملMultidimensional Balanced Binary Trees
A bstract-A new balanced multidimensional tree structure called a k-dimensional balanced binary tree, k a positive integer, is presented and investigated. It is shown that the data structure can be used to manage a set of n k-dimensional data items such that access, insertion, and deletion operations can be supported in Ooog n + k) time. The data structure is a multidimensional generalization o...
متن کاملSimple Balanced Binary Search Trees
Efficient implementations of sets and maps (dictionaries) are important in computer science, and balanced binary search trees are the basis of the best practical implementations. Pedagogically, however, they are often quite complicated, especially with respect to deletion. I present complete code (with justification and analysis not previously available in the literature) for a purely-functiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.08.003